Speech compression with cosine and wavelet packet near-best bases
نویسنده
چکیده
Compression of speech from the TIMIT corpus was investigated for several transform domain methods coding near-best and best bases from cosine and wavelet packet transforms. Satisficing (suboptimizing) search algorithms for selecting near-best bases were compared with optimizing algorithms for best bases in these adaptive tree-structured transforms. Experiments were performed on several hundred seconds of speech spoken by both male and female speakers from all dialect regions of the TIMIT corpus. Near-best bases provided rate-distortion performance effectively as good as that of best bases but without the additional computational penalty. Cosine packet bases outperformed wavelet packet bases.
منابع مشابه
Satisficing search algorithms for selecting near-best bases in adaptive tree-structured wavelet transforms
Satisficing search algorithms are proposed for adaptively selecting near-best basis and near-best frame decompositions in redundant tree-structured wavelet transforms. Any of a variety of additive or non-additive information cost functions can be used as the decision criterion for comparing and selecting nodes when searching through the tree. The algorithms are applicable to tree-structured tra...
متن کاملNear-best Wpt Compression of Polysomnograms
Near-best and best wavelet packet transforms were compared with wavelet transforms for the compression of polysomnograms in a low bitrate telemonitoring application. Near-best wavelet packet transforms provided better overall performance with respect to efficiency of computation and compression, and amenability for use in more sophisticated quality-on-demand algorithms. Keywords— near-best base...
متن کاملNear-best Basis Selection Algorithms with Non-additive Information Cost Functions
Search algorithms for finding signal decompositions called near-best bases using decision criteria called non-additive information costs are proposed for selecting bases in wavelet packet transforms. These new methods are compared with the best bases and additive information costs of Coifman and Wickerhauser [1]. All near-best and best bases were also compared with the matching pursuit decompos...
متن کاملImage Compression by Parameterized-Model Coding of Wavelet Packet Near-Best Bases
Top-down tree search algorithms with non-additive information cost comparisons as decision criteria have recently been proposed by Taswell for the selection of near-best bases in wavelet packet transforms. Advantages of top-down non-additive near-best bases include faster computation speed, smaller memory requirement, and extensibility to biorthogonal wavelets in addition to orthogonal wavelets...
متن کاملQuality Controlled Compression of Polysomnograms
A novel compression algorithm incorporating the near-best wavelet packet transform is introduced for multi-modal signals in low bitrate telemonitoring applications. The method permits flexible control of the total bitrate subject to the constraints of the channel, and the allocation of the total bitrate to each of the constituent modes subject to the quality preferences of the observer. Its per...
متن کامل